Asymptotically Optimal Topological Quantum Compiling
نویسندگان
چکیده
منابع مشابه
Asymptotically Optimal Topological Quantum Compiling
We address the problem of compiling quantum operations into braid representations for non-Abelian quasiparticles described by the Fibonacci anyon model. We classify the single-qubit unitaries that can be represented exactly by Fibonacci anyon braids and use the classification to develop a probabilistically polynomial algorithm that approximates any given single-qubit unitary to a desired precis...
متن کاملTopological quantum compiling
A method for compiling quantum algorithms into specific braiding patterns for non-Abelian quasiparticles described by the so-called Fibonacci anyon model is developed. The method is based on the observation that a universal set of quantum gates acting on qubits encoded using triplets of these quasiparticles can be built entirely out of three-stranded braids three-braids . These three-braids can...
متن کاملAsymptotically Optimal Discrimination between Pure Quantum States
We consider the decision problem between a finite number of states of a finite quantum system, when an arbitrarily large number of copies of the system is available for measurements. We provide an upper bound on the exponential rate of decay of the averaged probability of rejecting the true state. It represents a generalized quantum Chernoff distance of a finite set of states. As our main resul...
متن کاملAsymptotically Optimal Sampling-Based Algorithms for Topological Motion Planning
Topological motion planning is a planning problem embedding topological concept of trajectories. In this work, we propose two asymptotically optimal sampling-based algorithms for topological motion planning: (a) a batch processingbased planner, termed Fast Marching Homology-embedded Tree star (FMHT*); and (b) an incremental anytime algorithm, termed Rapidly-exploring Random Homology-embedded Tr...
متن کاملAsymptotically optimal quantum circuits for d-level systems.
Scalability of a quantum computation requires that the information be processed on multiple subsystems. However, it is unclear how the complexity of a quantum algorithm, quantified by the number of entangling gates, depends on the subsystem size. We examine the quantum circuit complexity for exactly universal computation on many d-level systems (qudits). Both a lower bound and a constructive up...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2014
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.112.140504